Approximate optimal influence over an agent through an uncertain interaction dynamic
نویسندگان
چکیده
An approximate optimal indirect regulation problem is considered for two nonlinear uncertain agents. influencing agent tasked with optimally intercepting and directing a roaming to goal location. The not directly controlled by the agent, but instead moves based on some interaction dynamic. To overcome this challenge, virtual controller designed yield desired influence agent. In addition, an dynamic programming (ADP) strategy used develop solution control using computationally efficient function approximation method. Because system uncertainties are in both agents, data-based parameter identification method called integral concurrent learning (ICL) identify dynamics. A Lyapunov-based stability analysis performed which proves closed-loop pursuing systems uniformly ultimately bounded (UUB). Simulation experimental results provided demonstrate performance of developed
منابع مشابه
Dynamic Approximate Matchings with an Optimal Recourse Bound
In the area of dynamic matching algorithms, the number of changes to the matching per update step, also known as the recourse bound, is an important measure of quality, Nevertheless, the worstcase recourse bounds of almost all known dynamic approximate matching algorithms are prohibitively large, significantly larger than the corresponding update times. In this paper we fill in this gap via a s...
متن کاملDynamic Influence Nets: An Extension of Timed Influence Nets for Modeling Dynamic Uncertain Situation
This paper proposes structural and parametric enhancements in the Timed Influence Nets (TINs) based framework for modeling Effects-Based Operations (EBO). The existing TIN framework does not have the capability to model the impact of different sequences of actions. Thus, no matter what the sequence of action is, the final outcome remains the same. Furthermore, it is assumed that the influence o...
متن کاملBuilding Dynamic Capabilities through Emergent Groups in an Uncertain World
One Sunday in Southern California, with Santa Ana winds blowing, the tinder dry, and the temperature hot, a forest fire broke out that rapidly became uncontained. Then six more large fires broke out. Soon homes were consumed. The entire city of San Diego seemed engulfed in an uncontained firestorm. Two different emergent groups from a radio station and an internet software development firm comp...
متن کاملApproximate Substring Matching over Uncertain Strings
Text data is prevalent in life. Some of this data is uncertain and is best modeled by probability distributions. Examples include biological sequence data and automatic ECG annotations, among others. Approximate substring matching over uncertain texts is largely an unexplored problem in data management. In this paper, we study this intriguing question. We propose a semantics called (k, τ)-match...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2021
ISSN: ['1873-2836', '0005-1098']
DOI: https://doi.org/10.1016/j.automatica.2021.109913